Euclidean spanners in high dimensions

نویسندگان

  • Sariel Har-Peled
  • Piotr Indyk
  • Anastasios Sidiropoulos
چکیده

A classical result in metric geometry asserts that any n-point metric admits a linear-size spanner of dilation O(log n) [PS89]. More generally, for any c > 1, any metric space admits a spanner of size O(n), and dilation at most c. This bound is tight assuming the well-known girth conjecture of Erdős [Erd63]. We show that for a metric induced by a set of n points in high-dimensional Euclidean space, it is possible to obtain improved dilation/size trade-offs. More specifically, we show that any n-point Euclidean metric admits a near-linear size spanner of dilation O( √ log n). Using the LSH scheme of Andoni and Indyk [AI06] we further show that for any c > 1, there exist spanners of size roughly O(n 2 ) and dilation O(c). Finally, we also exhibit super-linear lower bounds on the size of spanners with constant dilation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometric spanners with applications in wireless networks

In this paper we investigate the relations between spanners, weak spanners, and power spanners in R D for any dimension D and apply our results to topology control in wireless networks. For c ∈ R, a c-spanner is a subgraph of the complete Euclidean graph satisfying the condition that between any two vertices there exists a path of length at most c-times their Euclidean distance. Based on this a...

متن کامل

Spanners, Weak Spanners, and Power Spanners for Wireless Networks

For , a -spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most times their geometric distance. Based on this property to approximate a complete weighted graph, sparse spanners have found many applications, e.g., in FPTAS, geometric searching, and radio networks. In a weak -spanner, this path may be arbitrary l...

متن کامل

On Spanners and Lightweight Spanners of Geometric Graphs

We consider the problem of computing spanners of Euclidean and unit disk graphs embedded in the two-dimensional Euclidean plane. We are particularly interested in spanners that possess useful properties such as planarity, bounded degree, and/or light weight. Such spanners have been extensively studied in the area of computational geometry and have been used as the building block for constructin...

متن کامل

$\mathcal{O}(k)$-robust spanners in one dimension

A geometric t-spanner on a set of points in Euclidean space is a graph containing for every pair of points a path of length at most t times the Euclidean distance between the points. Informally, a spanner is O(k)-robust if deleting k vertices only harms O(k) other vertices. We show that on any one-dimensional set of n points, for any ε > 0, there exists an O(k)-robust 1-spanner with O(n1+ε) edg...

متن کامل

Randomized and deterministic algorithms for geometric spanners of small diameter

Let S be a set of n points in IR and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q of points there is a path from p to q of length at most t times the Euclidean distance between p and q. Such a path is called a t-spanner path. The spanner diameter of such a spanner is defined as the smallest integer D suc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013